Linear programming

Results: 2606



#Item
991A Tale of Three Algorithms: Linear Time Suffix Array Construction ¨ ainen ¨ Juha Karkk

A Tale of Three Algorithms: Linear Time Suffix Array Construction ¨ ainen ¨ Juha Karkk

Add to Reading List

Source URL: cs.ioc.ee

Language: English - Date: 2006-09-05 14:35:13
992CS 1173: MATLAB mean function The mean function returns the mean or average along an  array dimension. B = mean(A, dim) resulting average

CS 1173: MATLAB mean function The mean function returns the mean or average along an  array dimension. B = mean(A, dim) resulting average

Add to Reading List

Source URL: www.cs.utsa.edu

Language: English - Date: 2009-09-22 20:24:28
993CS 1173: MATLAB median function The median function returns the median or middle value  along an array dimension. B = median(A, dim) resulting median

CS 1173: MATLAB median function The median function returns the median or middle value  along an array dimension. B = median(A, dim) resulting median

Add to Reading List

Source URL: www.cs.utsa.edu

Language: English - Date: 2009-09-22 20:24:48
994The Hong Kong University of Science and Technology

The Hong Kong University of Science and Technology

Add to Reading List

Source URL: www.bm.ust.hk

Language: English - Date: 2010-11-15 23:21:55
995Optimization General remarks We are confronted not only with optimization in mathematics and engineering, but also in almost every aspect of life. Maybe, optimization is most important process of life. When we learn wal

Optimization General remarks We are confronted not only with optimization in mathematics and engineering, but also in almost every aspect of life. Maybe, optimization is most important process of life. When we learn wal

Add to Reading List

Source URL: alphard.ethz.ch

Language: English - Date: 2007-10-03 06:48:07
996Convex Relaxation of Mixture Regression with Efficient Algorithms Novi Quadrianto, Tib´erio S. Caetano, John Lim NICTA - Australian National University Canberra, Australia

Convex Relaxation of Mixture Regression with Efficient Algorithms Novi Quadrianto, Tib´erio S. Caetano, John Lim NICTA - Australian National University Canberra, Australia

Add to Reading List

Source URL: webdocs.cs.ualberta.ca

Language: English - Date: 2009-09-20 18:03:02
997Biosequence Algorithms, SpringLecture 7: Linear-Time Construction of Suffix Trees ¨ Pekka Kilpelainen

Biosequence Algorithms, SpringLecture 7: Linear-Time Construction of Suffix Trees ¨ Pekka Kilpelainen

Add to Reading List

Source URL: www.cs.uku.fi

Language: English - Date: 2005-02-10 03:05:03
998Convex Relaxations of Latent Variable Training Yuhong Guo and Dale Schuurmans Department of Computing Science University of Alberta {yuhong,dale}@cs.ualberta.ca

Convex Relaxations of Latent Variable Training Yuhong Guo and Dale Schuurmans Department of Computing Science University of Alberta {yuhong,dale}@cs.ualberta.ca

Add to Reading List

Source URL: webdocs.cs.ualberta.ca

Language: English - Date: 2008-01-19 16:30:45
999The IMSL® Fortran Numerical Library Evaluation Guide Rogue Wave Software 5500 Flatiron Parkway, Suite 200 Boulder, CO 80301, USA

The IMSL® Fortran Numerical Library Evaluation Guide Rogue Wave Software 5500 Flatiron Parkway, Suite 200 Boulder, CO 80301, USA

Add to Reading List

Source URL: docs.roguewave.com

Language: English - Date: 2014-11-05 14:34:37
1000Polar Operators for Structured Sparse Estimation Xinhua Zhang Machine Learning Research Group National ICT Australia and ANU

Polar Operators for Structured Sparse Estimation Xinhua Zhang Machine Learning Research Group National ICT Australia and ANU

Add to Reading List

Source URL: webdocs.cs.ualberta.ca

Language: English - Date: 2013-11-09 21:13:55